Knowledge-Based Anytime Computation

Knowledge-Based Anytime Computation

Formally Verifying Dynamic Properties of Knowledge Based Systems

In this paper we study dynamic properties of knowledge-based systems. We argue the importance of such dynamic properties for the construction and analysis of knowledge-based systems. We present a case-study of a simple classification method for which we formulate and verify two dynamic properties which are concerned with the anytime behaviour and the computation trace of the classification meth...

Control of Mobile Robots Using Anytime Computation

Anytime algorithms are algorithms whose quality of results improves gradually as computation time increases. They have attracted growing attention in recent years as a key mechanism for time-critical planning and control of autonomous robots. By introducing computation time as a degree of freedom, anytime algorithms define a scheduling problem involving the activation and interruption of the an...

Resettably Secure Computation

The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS’01) as a strengthening of the classical notion of zero-knowledge. A rZK protocol remains zero-knowledge even if the verifier can reset the prover back to its initial state anytime during the protocol execution and force it to use the same random tape again and again. Following this wo...

A Logic for Approximate First-Order Reasoning

In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the first-order case is only semi-decidable. Even in the restricted case of finite universes of discourse, reasoning remains inherently intractable, as the reasoner has to deal with two independent sources of complexity: unbounded c...